Graph-indexed random walks on special classes of graphs
نویسنده
چکیده
We investigate the paramater of the average range of M Lipschitz mapping of a given graph. We focus on well-known classes such as paths, complete graphs, complete bipartite graphs and cycles and show closed formulas for computing this parameter and also we conclude asymptotics of this parameter on these aforementioned classes.
منابع مشابه
Algorithmic aspects of graph-indexed random walks
Graph-indexed random walks (or equivalently M -Lipschitz mappings of graphs) are a generalization of standard random walk on Z. For M ∈ N, an M-Lipschitz mapping of a connected rooted graph G = (V,E) is a mapping f : V → Z such that root is mapped to zero and for every edge (u, v) ∈ E we have |f(u) − f(v)| ≤ M . We study two natural problems regarding graph-indexed random walks. 1. Computing th...
متن کاملRandom Walks on Hypergraphs with Applications to Disease-Gene Prioritization
Typically, gene interaction networks are expressed as graphs, storing pairwise interactions between genes. Because of the vast amount of literature on statistical graph inference, this is a useful representation in practice. However, such a pairwise representation ignores more complex features of gene interactions, such as gene regulation and assembly. In this thesis, we propose a hypergraph mo...
متن کاملClassification in Graphs using Discriminative Random Walks
This paper describes a novel technique, called D-walks, to tackle semi-supervised classification problems in large graphs. We introduce here a betweenness measure based on passage times during random walks of bounded lengths in the input graph. The class of unlabeled nodes is predicted by maximizing the betweenness with labeled nodes. This approach can deal with directed or undirected graphs wi...
متن کاملBounded Arboricity to Determine the Local Structure of Sparse Graphs
A known approach of detecting dense subgraphs (communities) in large sparse graphs involves first computing the probability vectors for short random walks on the graph, and then using these probability vectors to detect the communities, see Latapy and Pons [2005]. In this paper we focus on the first part of such an approach i.e. the computation of the probability vectors for the random walks, a...
متن کاملRandom random walks on Z d 2
We consider random walks on classes of graphs de®ned on the ddimensional binary cube Zd2 by placing edges on n randomly chosen parallel classes of vectors. The mixing time of a graph is the number of steps of a random walk before the walk forgets where it started, and reaches a random location. In this paper we resolve a question of Diaconis by ®nding exact expressions for this mixing time that...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
- CoRR
دوره abs/1801.05498 شماره
صفحات -
تاریخ انتشار 2018